Monte-Carlo Tree Search for Simulation-based Strategy Analysis

نویسندگان

  • Alexander Zook
  • Brent Harrison
  • Mark O. Riedl
چکیده

Games are often designed to shape player behavior in a desired way; however, it can be unclear how design decisions affect the space of behaviors in a game. Designers usually explore this space through human playtesting, which can be time-consuming and of limited effectiveness in exhausting the space of possible behaviors. In this paper, we propose the use of automated planning agents to simulate humans of varying skill levels to generate game playthroughs. Metrics can then be gathered from these playthroughs to evaluate the current game design and identify its potential flaws. We demonstrate this technique in two games: the popular word game Scrabble and a collectible card game of our own design named Cardonomicon. Using these case studies, we show how using simulated agents to model humans of varying skill levels allows us to extract metrics to describe game balance (in the case of Scrabble) and highlight potential design flaws (in the case of Cardonomicon).

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Monte Carlo-Based Search Strategy for Dimensionality Reduction in Performance Tuning Parameters

Redundant and irrelevant features in high dimensional data increase the complexity in underlying mathematical models. It is necessary to conduct pre-processing steps that search for the most relevant features in order to reduce the dimensionality of the data. This study made use of a meta-heuristic search approach which uses lightweight random simulations to balance between the exploitation of ...

متن کامل

Monte Carlo Chess

MCC, a UCT based Chess engine, was created in order to test the performance of Monte-Carlo Tree Search for the game of Chess. Mainly by modifications that increase the accuracy of the simulation strategy, the performance of the base implementation was improved by approximately 864 Elo. MCC performed still too bad to compete with Minimax based chess programs or to seriously suffer from search tr...

متن کامل

Evaluation Function Based Monte-Carlo LOA

Recently, Monte-Carlo Tree Search (MCTS) has advanced the field of computer Go substantially. In the game of Lines of Action (LOA), which has been dominated in the past by αβ, MCTS is making an inroad. In this paper we investigate how to use a positional evaluation function in a Monte-Carlo simulation-based LOA program (MC-LOA). Four different simulation strategies are designed, called Evaluati...

متن کامل

Cooperative Games with Monte Carlo Tree Search

Monte Carlo Tree Search approach with Pareto optimality and pocket algorithm is used to solve and optimize the multi-objective constraint-based staff scheduling problem. The proposed approach has a two-stage selection strategy and the experimental results show that the approach is able to produce solutions for cooperative games.

متن کامل

To UCT, or not to UCT? (Position Paper)

Monte-Carlo search is successfully used in simulation-based planning for various large-scale sequential decision problems, and the UCT algorithm (Kocsis and Szepesvári 2006) seems to be the choice in most (if not all) such recent success stories. Based on some recent discoveries in theory and empirical analysis of Monte-Carlo search, here we argue that, if online sequential decision making is y...

متن کامل

Kinetic Monte Carlo Simulation of Oxalic Acid Ozonationover Lanthanum-based Perovskitesas Catalysts

Kinetic Monte Carlo simulation was applied to investigation of kinetics and mechanism of oxalic acid degradation by direct and heterogeneous catalytic ozonation. La-containing perovskites including LaFeO3, LaNiO3, LaCoO3 and LaMnO3 was studied as catalyst for oxalic acid ozonation. The reaction kinetic mechanisms of each abovementioned catalytic systems has been achieved. The rate constants val...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2015